Tracing Relations Probabilistically
نویسنده
چکیده
We investigate similarities between non-deterministic and probabilistic ways of describing a system in terms of computation trees. We first show that the construction of traces for both kinds of relations follow the same principles of construction (which could be described in terms of monads, but this does not happen here). Finally representations of measurable trees in terms of probabilistic relations are given.
منابع مشابه
A Logic of Comparative Support: Qualitative Conditional Probability Relations Representable by Popper Functions
This article presents axioms for comparative conditional probability relations. The axioms presented here are more general than usual. Each comparative relation is a weak partial order on pairs of sentences (i.e. each relation is transitive and reflexive) but need not be a complete order relation. The axioms for these comparative relations are probabilistically sound for the broad class of cond...
متن کاملWeighted Multipass Methods for Global Illumination
In multipass rendering, care has to be taken to include all light transport only once in the final solution. Therefore the different methods in current multipass configurations handle a perfectly disjunct part of the light transport. In this paper a Monte Carlo variance reduction technique is presented that probabilistically weights overlapping transport between different methods. A good heuris...
متن کاملDecision-Making in the Context of Imprecise Probabilistic Beliefs
Coherent imprecise probabilistic beliefs are modelled as incomplete comparative likelihood relations admitting a multiple-prior representation. Under a structural assumption of Equidivisibility, we provide an axiomatization of such relations and show uniqueness of the representation. In the second part of the paper, we formulate a behaviorally general axiom relating preferences and probabilisti...
متن کاملRunning head: TRANSITIVE REASONING IN CAUSAL CHAINS Transitive Reasoning Distorts Induction in Causal Chains
A probabilistic causal chain ABC may intuitively appear to be transitive: If A probabilistically causes B, and B probabilistically causes C, A probabilistically causes C. However, probabilistic causal relations are only transitive if the so-called Markov condition holds. In two experiments, we examined how people make probabilistic judgments about indirect relationships AC in causal chains A...
متن کاملAn Object Oriented Library for Tracing Requirements
We present the overall design of an object oriented library for use when developing tracing capable applications The library is im plemented as java classes and consists of de nitions of the basic classes for registration of objects and relations as well as methods for di erent types of tracing procedures and components for manipulating tracing results and viewing them graphically
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 66 شماره
صفحات -
تاریخ انتشار 2003